منابع مشابه
David Smyth
David Smyth is a plant developmental geneticist. He began his independent career at Monash University in Melbourne in 1974, where he investigated the basis of the very large genomes of the true lilies (Lilium species) when DNA cloning methods became available. Two abundant dispersed elements turned out to be retrotransposons, revealing their important role in bulking up some plant genomes. In 1...
متن کاملResolution in the Smyth powerdomain
The purposes of this paper are (i) to give a new, eecient representation of Smyth powerdomains as 0-inhabited information systems, following the style of Scott; (ii) to introduce, as a consequence of this representation, a generalized resolution method for an arbitrary Smyth powerdomain and show the soundness and completeness of this method. The connection of (i) with (ii) comes from the observ...
متن کاملA Note on the Smyth Powerdomain Construction
Powerdomains are the order-theoretic analogue of powersets and are used to model non-determinism and concurrency [9, 8, 3, 10]. There exist three standard kinds of order-theoretic powerdomain: the Plotkin, Smyth and Hoare powerdomain. To obtain a powerdomain from a given !-algebraic cpo D, one constructs the collection F(D) of finite, non-empty sets of finite elements from D (for necessary defi...
متن کاملQuasicontinuous Domains and the Smyth Powerdomain
In Domain Theory quasicontinuous domains pop up from time to time generalizing slightly the powerful notion of a continuous domain. It is the aim of this paper to show that quasicontinuous domains occur in a natural way in relation to the powerdomains of finitely generated and compact saturated subsets. Properties of quasicontinuous domains seem to be best understood from that point of view. Th...
متن کاملClause-logical Aspects of the Smyth Powerdomain
Synopsis. In this paper we study the logical aspects of the Smyth powerdomain via clausal theories. The clause-theoretic view leads to an unexpectedly simple, operational, representation of the Smyth powerdomain. At the heart of this representation is a hyperresolution rule, whose completeness hinges upon a combinatorial lemma for the book-keeping of intermediate clauses. These results are moti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1995
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00029-5